A Procedural Logic
نویسندگان
چکیده
Much of our commonsense knowledge about the real world is concerned wi th the way things are done. This knowledge is often in the form of procedures or sequences of actions for achieving particular goals. In this paper, a formalism is presented for representing such knowledge based on the notion of process. A declarative semantics for the represen tation is given, which allows a user to state facts about the effects of doing things in the problem domain of interest. An operational semantics is also provided, which shows how this knowledge can be used to achieve given goals or to form intentions regarding their achievement. The for malism also serves as an executable program specification language suitable for constructing complex systems.
منابع مشابه
The information in intuitionistic logic
Issues about information spring up wherever one scratches the surface of logic. Here is a case that raises delicate issues of ‘factual’ versus ‘procedural’ information, or ‘statics’ versus ‘dynamics’. What does intuitionistic logic, perhaps the earliest source of informational and procedural thinking in contemporary logic, really tell us about information? How does its view relate to its ‘cousi...
متن کاملTransaction Logic: Unifying Declarative and Procedural Knowledge (Extended Abstract)
This paper presents AI applications of the recently proposed Transaction Logic (abbr., 7-7z) [2]. Transaction Logic is a novel formalism that accounts in a clean and declarative fashion for the phenomenon of updating first-order knowledge bases, most notably, databases and logic programs. Transaction Logic has a natural model theory and a sound-and-complete proof theory. Unlike many other logic...
متن کاملA program logic for higher-order procedural variables and non-local jumps
Relying on the formulae-as-types paradigm for classical logic, we define a program logic for an imperative language with higher-order procedural variables and non-local jumps. Then, we show how to derive a sound program logic for this programming language. As a by-product, we obtain a non-dependent type system which is more permissive than what is usually found in statically typed imperative la...
متن کاملA Procedural Semantics for Multi-adjoint Logic Programming
Multi-adjoint logic program generalise monotonic logic programs introduced in [1] in that simultaneous use of several implications in the rules and rather general connectives in the bodies are allowed. In this work, a procedural semantics is given for the paradigm of multiadjoint logic programming and completeness theorems are proved.
متن کاملDiaLaw: Levels, Dialog Trees, Convincing Arguments
DiaLaw is a dialogical model of legal justification. An important characteristic of the formal and implemented model DiaLaw is that both logic-based arguments and mere convincing statements can be modelled. The support of both structural (logic-based) arguments and procedural arguments (mere convincing statements) is expressed by different levels in the dialog. In this paper so-called dialog tr...
متن کاملLogic Programing in Artificial Intelligence
Logic programming originated in the field of artificial intelligence * It was artificial intelligence that provided both the theorem-proving research for its backward-reasoning execution strategy [42,47,68] and its first intended applications in natural language question-answering [14]-It also provided the controversy (see e.g« [32,81]). between the relative merita of procedural versus declarat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1985